Multiobjective Genetic Algorithm to Solve the Train Crew Scheduling Problem

نویسنده

  • MING-SHEN JIAN
چکیده

-This paper presents a multiobjective genetic algorithm (MOGA)to solve the train crew pairing problem in railway companies. The proposed MOGA has several features, such as 1) A permutation-based model is proposed rather than the 0-1 set partition model. 2) Instead of pre-assigning a fixed group number of crewmembers, the proposed method can determine it by performing the evolutionary process. 3) The crossover and mutation operators are enhanced so that the duty time and the duty period can be integrated and considered during the evolutionary process. Experiments show that the proposed MOGA can find out optimal solution with exact group number of crewmembers instead of pre-assigning it so that the effective and efficient crew pairing can be yielded. Keywords-component; train crew pairing, genetic algorithm, multiobjective

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

متن کامل

Locomotive assignment problem with train precedence using genetic algorithm

This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...

متن کامل

Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach

Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...

متن کامل

A Comprehensive Approach for Railway Crew Scheduling Problem (Case Study: Iranian Railway Network)

The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...

متن کامل

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010